Deterministic context-free language - PDFSEARCH.IO - Document Search Engine

Deterministic context-free language
Results: 19

#	Item
11	Deterministic Pushdown Automata 237 Deterministic PDA (DPDA) A PDA P = (Q, Σ, Γ, δ, q0 , Z0 , F ) is deterministic if and only if Add to Reading List Source URL: www.cs.uiuc.edu Language: English - Date: 2005-10-18 14:54:39 Models of computation Computer science Applied mathematics Deterministic pushdown automaton Regular language Regular expression Context-free language Automata theory Formal languages Theoretical computer science
12	CS345: Theory of Computation Class schedule & room: Time: Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-04-10 18:04:10 Theory of computation Models of computation Computer science Context-free language Recursively enumerable language Finite-state machine Regular language Deterministic finite automaton Nondeterministic finite automaton Formal languages Theoretical computer science Automata theory
13	Decidability of Bisimulation Equivalence for Pushdown Processes Colin Stirling Division of Informatics University of Edinburgh Edinburgh EH9 3JZ, UK Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2009-05-20 09:59:44 Applied mathematics Computer science Deterministic pushdown automaton Bisimulation Computability Context-free language Finite-state machine Automata theory Models of computation Theoretical computer science
14	Visibly Pushdown Languages ∗ Rajeev Alur University of Pennsylvania Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2006-06-22 11:47:24 Theoretical computer science Models of computation Computer science Nested word Deterministic pushdown automaton Pushdown automaton Deterministic context-free language Context-free language Omega language Automata theory Theory of computation Formal languages
15	1 Pushdown Automata Hendrik Jan Hoogeboom and Joost Engelfriet Add to Reading List Source URL: www.liacs.nl Language: English - Date: 2004-05-10 11:22:35 Computer science Deterministic pushdown automaton Pushdown automaton LL parser Finite-state machine Context-free language Symbol Greibach normal form Nested word Automata theory Models of computation Theoretical computer science
16	Non-deterministic pushdown automata Regular languages are recognized by finite automata, context free languages are recognized by non-deterministic pushdown automata. Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2012-01-14 04:37:24 Computer science Pushdown automaton Deterministic pushdown automaton Computability Context-free language Finite-state machine National Parliamentary Debate Association Stack Computation history Automata theory Models of computation Theoretical computer science
17	Chapter 3 Pushdown Automata and Context Free Languages Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2009-10-01 15:20:36 Computer science Stack Finite-state machine Context-free language Pushdown automaton Deterministic pushdown automaton Automata theory Models of computation Theoretical computer science
18	PDF Document Add to Reading List Source URL: users.utu.fi Language: English - Date: 2010-09-13 04:41:37 Formal languages Computer science Nested word Deterministic pushdown automaton Pushdown automaton Counter automaton LL parser Conjunctive grammar Context-free language Automata theory Models of computation Theoretical computer science
19	PDF Document Add to Reading List Source URL: dingo.sbs.arizona.edu Language: English - Date: 2006-02-27 18:05:32 Mathematics Chomsky hierarchy Formal grammar Regular language Context-free grammar Context-sensitive grammar Automata theory Deterministic finite automaton Linear grammar Formal languages Theoretical computer science Logic